On the complexity of data disjunctions
نویسندگان
چکیده
We study the complexity of data disjunctions in disjunctive deductive databases (DDDBs), i.e., minimal clauses R( c1) _ _ R( ck), k 2, derived from the database in which all atoms involve the same predicate R. We consider deciding existence and uniqueness of a data disjunction, as well as actually computing one, both for propositional (data) and nonground (program) complexity of the database. Our results extend and complement previous results on the complexity of disjunctive databases, and provide tools for the analysis of the complexity of function computation using upgrading techniques, which we develop for this purpose.
منابع مشابه
Efficient Semi-supervised and Active Learning of Disjunctions
We provide efficient algorithms for learning disjunctions in the semi-supervised setting under a natural regularity assumption introduced by (Balcan & Blum, 2005). We prove bounds on the sample complexity of our algorithms under a mild restriction on the data distribution. We also give an active learning algorithm with improved sample complexity and extend all our algorithms to the random class...
متن کاملBiclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity
In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...
متن کاملThe Effect of Tax Complexity on Economic Growth: A Dynamic Panel Data Model for Selected Developed Countries
One of the most important concerns of economists is identification of the economic growth determinants. Meanwhile, institutional factors are of important ones. This paper aims to empirically investigate the effect of tax complexity, as a determinant institutional factor of economic growth in 42 relatively developed economies during 2008-2016. The tax complexity variables include: the time spent...
متن کامل3D Scene and Object Classification Based on Information Complexity of Depth Data
In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...
متن کاملExtending the Knowledge Compilation Map: Krom, Horn, Affine and Beyond
We extend the knowledge compilation map introduced by Darwiche and Marquis with three influential propositional fragments, the Krom CNF one (also known as the bijunctive fragment), the Horn CNF fragment and the affine fragment (also known as the biconditional fragment) as well as seven additional languages based on them, and composed respectively of Krom or Horn CNF formulas, renamable Horn CNF...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 288 شماره
صفحات -
تاریخ انتشار 2002